D-MMLQ Algorithm for Multi-level Queue Scheduling

نویسندگان

  • Manupriya Hasija
  • Akhil Kaushik
  • Satvika Kaushik
  • Manoj barnela
چکیده

TIT&S, Bhiwani TIT&S, Bhiwani TIT&S, Bhiwani TIT&S, Bhiwani Summary Since the advent of Operating system, the focus of the work is aimed at better resource scheduling. Handling of multiple tasks at a single time by single processor is old story now. Today is the time of multitasking as well as multiprocessing. The scheduling of processes or tasks have taken a whirlwind after the concept of multiprocessing. There are a lot of well-known scheduling algorithms for job allocation on uniprocessor system but they may not fit well under the system having multiple processors. Altogether the thought of multiprocessing systems gives overheads but still make the idea amazingly interesting. This paper takes into account the deadline concept to realize the real-time needs of a multiprocessor system with multiple queues and tries to conceptualize an innovative algorithm for the same.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Utilization of Cloud Resources using Adaptive Back Propagation Neural Network and Multi-Level Priority Queue Scheduling

With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...

متن کامل

Assessment of Response Time for New Multi Level Feedback Queue Scheduler

Response time is one of the characteristics of scheduler, happens to be a prominent attribute of any CPU scheduling algorithm. The proposed New Multi Level Feedback Queue [NMLFQ] Scheduler is compared with dynamic, real time, Dependent Activity Scheduling Algorithm (DASA) and Locke’s Best Effort Scheduling Algorithm (LBESA). We abbreviated beneficial result of NMLFQ scheduler in comparison with...

متن کامل

Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness

This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...

متن کامل

Analysis of Multi Level Feedback Queue Scheduling Using Markov Chain Model with Data Model Approach

Shweta Jain Department of Computer Applications, Shri R.G.P. Gujarati Professional Institute, Indore-10 Email: [email protected] Dr. Saurabh Jain Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore Email: [email protected] ----------------------------------------------------------------------ABSTRACT--------------------------------------------------------...

متن کامل

A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study

This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014